mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-31 09:43:11 +08:00
34 lines
1008 B
HTML
34 lines
1008 B
HTML
<p>Given a set of <strong>distinct</strong> positive integers <code>nums</code>, return the largest subset <code>answer</code> such that every pair <code>(answer[i], answer[j])</code> of elements in this subset satisfies:</p>
|
|
|
|
<ul>
|
|
<li><code>answer[i] % answer[j] == 0</code>, or</li>
|
|
<li><code>answer[j] % answer[i] == 0</code></li>
|
|
</ul>
|
|
|
|
<p>If there are multiple solutions, return any of them.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [1,2,3]
|
|
<strong>Output:</strong> [1,2]
|
|
<strong>Explanation:</strong> [1,3] is also accepted.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [1,2,4,8]
|
|
<strong>Output:</strong> [1,2,4,8]
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= nums.length <= 1000</code></li>
|
|
<li><code>1 <= nums[i] <= 2 * 10<sup>9</sup></code></li>
|
|
<li>All the integers in <code>nums</code> are <strong>unique</strong>.</li>
|
|
</ul>
|